An algorithm using the heuristic technique of Simulated Annealing to solve a\nscheduling problem is presented, focusing on the scheduling issues. The approximated\nmethod is examined together with its key parameters (freezing,\ntempering, cooling, number of contours to be explored), and the choices made\nin identifying these parameters are illustrated to generate a good algorithm\nthat efficiently solves the scheduling problem.
Loading....